Creating android and humanoid robots to furnish companionship in the nursing care of older people continues to attract substantial development capital and research. Some people object, though, that machines of this kind furnish human–robot interaction characterized by inauthentic relationships. In particular, robotic and artificial intelligence (AI) technologies have been charged with substituting mindless mimicry of human behaviour for the real presence of conscious caring offered by human nurses. When thus viewed as deceptive, the robots also have prompted corresponding concerns regarding (...) their potential psychological, moral, and spiritual implications for people who will be interacting socially with these machines. The foregoing objections and concerns can be assessed quite differently, depending upon ambient religious beliefs or metaphysical presuppositions. The complaints may be set aside as unnecessary, for example, within religious traditions for which even current robots can be viewed as presenting spiritual aspects. Elsewhere, technological cultures may reject the complaints as expression of outdated superstition, holding that the machines eventually will enjoy a consciousness described entirely in materialist and behaviourist terms. While recognizing such assessments, the authors of this essay propose that the heart of the foregoing objections and concerns may be evaluated, in part, scientifically – albeit with a conclusion recommending fundamental revisions in AI modelling of human mental life. Specifically, considerations now favour introduction of AI models using interactive classical and quantum computation. Without this change, the answer to the essay's title question arguably is ‘no’ – with it, the answer plausibly becomes ‘maybe’. Either outcome holds very interesting implications for nurses. (shrink)

The three dialogues in this contribution concern 21st century application of life‐like robots in the care of older adults. They depict conversations set in the near future, involving a philosopher (Dr Phonius) and a nurse (Dr Myloss) who manages care at a large facility for assisted living. In their first dialogue, the speakers discover that their quite different attitudes towards human‐robot interaction parallel fundamental differences separating their respective concepts of consciousness. The second dialogue similarly uncovers deeply contrasting notions of personhood (...) that appear to be associated with respective communities of nursing and robotics. The additional key awareness that arises in their final dialogue links applications of life‐like robots in the care of older adults with potential transformations in our understandings of ourselves – indeed, in our understandings of the nature of our own humanity. This series of dialogues, therefore, appears to address a topic in nursing philosophy that merits our careful attention. (shrink)

We show that every nontrivial interval in the recursively enumerable degrees contains an incomparable pair which have an infimum in the recursively enumerable degrees.

We prove that every countable relation on the enumeration degrees, \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} ${\frak E}$\end{document}, is uniformly definable from parameters in \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} ${\frak E}$\end{document}. Consequently, the first order theory of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} ${\frak E}$\end{document} is recursively isomorphic to the second order theory of arithmetic. By an effective version of coding lemma, we show that the first order (...) theory of the enumeration degrees of the \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $\Sigma^0_2$\end{document} sets is not decidable. (shrink)

We show that, for every partition F of the pairs of natural numbers and for every set C, if C is not recursive in F then there is an infinite set H, such that H is homogeneous for F and C is not recursive in H. We conclude that the formal statement of Ramsey's Theorem for Pairs is not strong enough to prove , the comprehension scheme for arithmetical formulas, within the base theory , the comprehension scheme for recursive formulas. (...) We also show that Ramsey's Theorem for Pairs is strong enough to prove some sentences in first order arithmetic which are not provable within . In particular, Ramsey's Theorem for Pairs is not conservative over for -sentences. (shrink)

Posner [6] has shown, by a nonuniform proof, that every ▵ 0 2 degree has a complement below 0'. We show that a 1-generic complement for each ▵ 0 2 set of degree between 0 and 0' can be found uniformly. Moreover, the methods just as easily can be used to produce a complement whose jump has the degree of any real recursively enumerable in and above $\varnothing'$ . In the second half of the paper, we show that the complementation (...) of the degrees below 0' does not extend to all recursively enumerable degrees. Namely, there is a pair of recursively enumerable degrees a above b such that no degree strictly below a joins b above a. (This result is independently due to S. B. Cooper.) We end with some open problems. (shrink)

A spate of recent articles on Thomas Reid’s aesthetic theory constitutes a valuable commentary on both Reid’s own theory and on eighteenth-century aesthetics. However, while these articles provide a generally sympatheic introduction to Reid’s position, they are primarily expository in nature and uncritical in tone. I shall therefore address the plausibility of both Reid’s general aesthetic theory and the arguments advanced for the theory. I contend that his theory, however much an improvement over those offered by his contemporaries, is fatally (...) flawed by internal confusion and inconsistency; he cannot justify his claim that beauty and sublimity are objective qualities of objects. My analysis focuses on Reid’s mature statement on aesthetics, the essay “Of Taste” found at the end of the Essays on the Intellectual Powers of Man. (shrink)

A spate of recent articles on Thomas Reid’s aesthetic theory constitutes a valuable commentary on both Reid’s own theory and on eighteenth-century aesthetics. However, while these articles provide a generally sympatheic introduction to Reid’s position, they are primarily expository in nature and uncritical in tone. I shall therefore address the plausibility of both Reid’s general aesthetic theory and the arguments advanced for the theory. I contend that his theory, however much an improvement over those offered by his contemporaries, is fatally (...) flawed by internal confusion and inconsistency; he cannot justify his claim that beauty and sublimity are objective qualities of objects. My analysis focuses on Reid’s mature statement on aesthetics, the essay “Of Taste” found at the end of the Essays on the Intellectual Powers of Man. (shrink)

We exhibit a structural difference between the truth-table degrees of the sets which are truth-table above 0′ and the PTIME-Turing degrees of all sets. Though the structures do not have the same isomorphism type, demonstrating this fact relies on developing their common theory.

Let A and B be subsets of the reals. Say that A κ ≥ B, if there is a real a such that the relation "x ∈ B" is uniformly Δ 1 (a, A) in L[ ω x,a,A 1 , x,a,A]. This reducibility induces an equivalence relation $\equiv_\kappa$ on the sets of reals; the $\equiv_\kappa$ -equivalence class of a set is called its Kleene degree. Let K be the structure that consists of the Kleene degrees and the induced partial order (...) K ≥. A substructure of K that is of interest is P, the Kleene degrees of the Π 1 1 sets of reals. If sharps exist, then there is not much to P, as Steel [9] has shown that the existence of sharps implies that P has only two elements: the degree of the empty set and the degree of the complete Π 1 1 set. Legrand [4] used the hypothesis that there is a real whose sharp does not exist to show that there are incomparable elements in P; in the context of V = L, Hrbacek has shown that P is dense and has no minimal pairs. The Hrbacek results led Simpson [6] to make the following conjecture: if V = L, then p forms a universal homogeneous upper semilattice with 0 and 1. Simpson's conjecture is shown to be false by showing that if V = L, then Godel's maximal thin Π 1 1 set is the infimum of two strictly larger elements of P. The second main result deals with the notion of jump in K. Let A' be the complete Kleene enumerable set relative to A. Say that A is low-n if A (n) has the same degree as $\varnothing^{(n)}$ , and A is high-n if A (n) has the same degree as $\varnothing^{(n + 1)}$ . Simpson and Weitkamp [7] have shown that there is a high (high-1) incomplete Π 1 1 set in L. They have also shown that various other Π 1 1 sets are neither high nor low in L. Legrand [5] extended their results by showing that, if there is a real x such that x # does not exist, then there is an element of P that, for all n, is neither low-n nor high-n. In § 2, ZFC is used to show that, for all n, if A is Π 1 1 and low-n then A is Borel. The proof uses a strengthened version of Jensen's theorem on sequences of admissible ordinals that appears in [7, Simpson-Weitkamp]. (shrink)

J. Łoś raised the following question: Under what conditions can a countable partially ordered set be extended to a dense linear order merely by adding instances of comparability ? We show that having such an extension is a Σ 1 l -complete property and so there is no Borel answer to Łoś's question. Additionally, we show that there is a natural Π 1 l -norm on the partial orders which cannot be so extended and calculate some natural ranks in that (...) norm. (shrink)

Harvey Siegel argues that minimum competency testing (MCT) is incompatible with strong sense critical thinking. His arguments are reviewed and contrasted with positions held by John E. McPeck and Michael Scriven. Siegel's arguments seem directed against the prevailing form of MCT. However, alternative formats which allow for the aggregate and context-sensitive nature of critical thinking are not doomed to the arbitrariness Siegel finds. MCT may be a legitimate and useful means for furthering critical thinking as one of our educational ideals.

Postmodernism is often characterized, among other things, as the belief in the unattainability of objective truth and as a rejection of teleological and reductionist, or essentialist, forms of thought. For instance, in his provocative book The Rhetoric of Economics, Donald McCloskey sketches the implications for economic methodology of Richard Rorty's rejection of the modernist quest for Truth, as represented by various rationalist and empiricist epistemologies. McCloskey describes modernist methodology as displaying a desire to predict and control, a search for objective–;which (...) often means measurable–;knowledge, and an attempt to develop a value-free inquiry, among other characteristics. This “methodological correctness,” McCloske suggests, is discredited by the postmodern dissatisfaction with traditional epistemology. Thus, in place of the modernist belief in a rule-guided path to truth, he advocates a “free market” approach to knowledge, in which participants in the variety of theoretical conversations agree to be earnest and listen politely to one another. (shrink)

We show that the existence of a recursively enumerable set whose Turing degree is neither low nor complete cannot be proven from the basic axioms of first order arithmetic (P -) together with Σ 2 -collection (BΣ 2 ). In contrast, a high (hence, not low) incomplete recursively enumerable set can be assembled by a standard application of the infinite injury priority method. Similarly, for each n, the existence of an incomplete recursively enumerable set that is neither low n nor (...) high n - 1 , while true, cannot be established in P - + BΣ n + 1 . Consequently, no bounded fragment of first order arithmetic establishes the facts that the high n and low n jump hierarchies are proper on the recursively enumerable degrees. (shrink)

We investigate the question “To what extent can random reals be used as a tool to establish number theoretic facts?” Let $\text{2-\textit{RAN\/}}$ be the principle that for every real $X$ there is a real $R$ which is 2-random relative to $X$. In Section 2, we observe that the arguments of Csima and Mileti [3] can be implemented in the base theory $\text{\textit{RCA}}_0$ and so $\text{\textit{RCA}}_0+\text{2-\textit{RAN\/}}$ implies the Rainbow Ramsey Theorem. In Section 3, we show that the Rainbow Ramsey Theorem is (...) not conservative over $\text{\textit{RCA}}_0$ for arithmetic sentences. Thus, from the Csima—Mileti fact that the existence of random reals has infinitary-combinatorial consequences we can conclude that $\text{2-\textit{RAN\/}}$ has non-trivial arithmetic consequences. In Section 4, we show that $\text{2-\textit{RAN\/}}$ is conservative over $\text{\textit{RCA}}_0+\text{\textit{B\/}$\,\Sigma$}_2$ for $\Pi^1_1$-sentences. Thus, the set of first-order consequences of $\text{2-\textit{RAN\/}}$ is strictly stronger than $P^-+I\Sigma_1$ and no stronger than $P^-+\text{\textit{B\/}$\,\Sigma$}_2$. (shrink)

We show that there is a low T-upper bound for the class of K-trivial sets, namely those which are weak from the point of view of algorithmic randomness. This result is a special case of a more general characterization of ideals in $\Delta _2^0 $ T-degrees for which there is a low T-upper bound.

We give an algorithm for deciding whether an embedding of a finite partial order [Formula: see text] into the enumeration degrees of the [Formula: see text]-sets can always be extended to an embedding of a finite partial order [Formula: see text].

We show that if there is a nonconstructible real, then every perfect set has a nonconstructible element, answering a question of K. Prikry. This is a specific instance of a more general theorem giving a sufficient condition on a pair $M\subset N$ of models of set theory implying that every perfect set in N has an element in N which is not in M.